Integer sequences - PDFSEARCH.IO - Document Search Engine

Integer sequences
Results: 1364

#	Item
371	Ten Problems in Experimental Mathematics David H. Bailey, Jonathan M. Borwein, Vishaal Kapoor, and Eric W. Weisstein March 9, [removed]INTRODUCTION. This article was stimulated by the recent SIAM “100 Digit Challenge” Add to Reading List Source URL: crd-legacy.lbl.gov Language: English - Date: 2013-05-22 11:27:18 Complex analysis Integer sequences Bailey–Borwein–Plouffe formula Combinatorics Number theory Integer relation algorithm Transcendental number Pi Fourier series Mathematical analysis Mathematics Mathematical series
372	Mathematics 320 Midterm Examination, Spring[removed]Marchisotto] Each question has a value of 40 points. Please show all your work. NAME: 1. For each of the following circle your answer and give a justification: Add to Reading List Source URL: www.csun.edu Language: English - Date: 2006-05-04 00:55:26 Integer sequences Number theory Operator theory Fibonacci number Non-analytic smooth function Mathematics Equivalence relation Mathematical analysis
373	Best Arm Identification in Multi-Armed Bandits Jean-Yves Audibert Imagine, Universit´e Paris Est & Willow, CNRS/ENS/INRIA, Paris, France Add to Reading List Source URL: www.princeton.edu Language: English - Date: 2011-06-28 04:16:37 Combinatorics Integer sequences Factorial Number theory Kullback–Leibler divergence Estimation theory Gamma distribution Binomial coefficient Mathematics Statistics Mathematical analysis
374	PROOF CHECKING THE RSA PUBLIC KEY ENCRYPTION ALGORITHM1 Robert S. Boyer and J Strother Moore MR Classification Numbers: 03-04, 03B35, 10A25, 68C20, 68G15 The development of mathematics toward greater precision has led, a Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2000-04-02 13:39:24 Number theory Integer sequences Electronic commerce Public-key cryptography RSA Theorem Prime number IP Nqthm Mathematics Logic Modular arithmetic
375	SPECIAL-INTEGER SEQUENCES CONTROLLED BY THREE PIRAiETERS DANIEL C . FIELDER Georgia Institute of Technology, Atlanta, Georgia 1. Add to Reading List Source URL: www.fq.math.ca Language: English - Date: 2010-07-21 22:19:16 Polynomials Integer sequences Diophantine approximation Low-discrepancy sequence Four-square cipher Mathematics Mathematical analysis Numerical analysis
376	SPECIAL INTEGER SEQUENCES CONTROLLED BY THREE PARAMETERS Table .6 k/n Add to Reading List Source URL: www.fq.math.ca Language: English - Date: 2010-07-21 22:19:06 C programming language International Obfuscated C Code Contest Word square Computer programming Computing Software engineering
377	Perfect Numbers over Simple Algebraic Number Fields Kieran Smallbone 15 March 2002 Table of Contents Add to Reading List Source URL: eprints.maths.ox.ac.uk Language: English - Date: 2009-07-20 09:53:40 Number theory Algebraic number theory Divisor function Prime number Perfect number Arithmetic function Gaussian integer Number Algebraic number field Mathematics Abstract algebra Integer sequences
378	The Combinatorics of Non-determinism∗ ´ eric ´ Peschanski‡ . Olivier Bodini†, Antoine Genitrini‡and Fred [removed], {Antoine.Genitrini,Frederic.Peschanski}@lip6.fr. Add to Reading List Source URL: www-apr.lip6.fr Language: English - Date: 2013-12-05 10:18:28 Enumerative combinatorics Integer sequences Computational complexity theory Factorial Computation tree B-tree Combinatory logic Combinatorial species Tree Mathematics Combinatorics Discrete mathematics
379	arXiv:1101.0259v1 [math.NT] 31 Dec[removed]ON THE SUM OF RECIPROCALS OF AMICABLE NUMBERS Jonathan Bayless Department of Mathematics, Husson University, Bangor, Maine 04401, USA [removed] Add to Reading List Source URL: arxiv.org Language: English - Date: 2011-01-03 20:23:16 Sieve theory Divisor function Prime number Modular arithmetic Chebyshev function Log-normal distribution Mathematics Number theory Integer sequences
380	ON DEFINING INTEGERS AND PROVING ARITHMETIC CIRCUIT LOWER BOUNDS ¨rgisser Peter Bu Abstract. Let τ (n) denote the minimum number of arithmetic operations sufficient to build the integer n from the constant 1. We prove Add to Reading List Source URL: math-www.uni-paderborn.de Language: English - Date: 2007-06-22 04:55:31 Field theory Complexity classes Computational complexity theory Polynomials Integer sequences Circuit complexity NP Finite field Algebraic geometry Theoretical computer science Abstract algebra Mathematics

UPDATE